By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 5, Issue 3, pp. 333-587

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Preface

Robert L. Constable and David Park

pp. 333-335

BibTeX  Abstract Full Text:  PDF

Lucid—A Formal System for Writing and Proving Programs

E. A. Ashcroft and W. W. Wadge

pp. 336-354

BibTeX  Abstract Full Text:  PDF

Proof Theory of Partial Correctness Verification Systems

Susan L. Gerhart

pp. 355-377

BibTeX  Abstract Full Text:  PDF

Correct Computation Rules for Recursive Languages

Peter J. Downey and Ravi Sethi

pp. 378-401

BibTeX  Abstract Full Text:  PDF

Generalized Program Schemas

Ashok K. Chandra

pp. 402-413

BibTeX  Abstract Full Text:  PDF

The Theoretical Aspects of the Optimal Fixedpoint

Zohar Manna and Adi Shamir

pp. 414-426

BibTeX  Abstract Full Text:  PDF

Computational Complexity of Multiple Recursive Schemata

Steven S. Muchnick

pp. 427-451

BibTeX  Abstract Full Text:  PDF

A Powerdomain Construction

G. D. Plotkin

pp. 452-487

BibTeX  Abstract Full Text:  PDF

The Relation between Computational and Denotational Properties for Scott's ${\text{D}}_\infty $-Models of the Lambda-Calculus

Christopher P. Wadsworth

pp. 488-521

BibTeX  Abstract Full Text:  PDF

Data Types as Lattices

Dana Scott

pp. 522-587

BibTeX  Abstract Full Text:  PDF